A Labelled Sequent-Calculus for Observation Logic
نویسنده
چکیده
We investigate observation logic, an intuitionnistic modal logic designed for reasoning about approximation and multiple contexts, and propose a sequent-calculus formulation of this logic. Due to the validy of an axiom (called T2) which is a weakening of T, one needs an adaptation of the usual sequent-calculus formalism in order to have some classical properties of sequent calculus, such as cut elimination and the subformula property. To solve this problem, we propose to assign to each proposition inside a proof a label, carrying some context information, and show the validity of some expected properties and manipulations in this framework.
منابع مشابه
Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents
We identify a subclass of labelled sequents called “labelled tree sequents” and show that these are notational variants of tree-hypersequents in the sense that a sequent of one type can be represented naturally as a sequent of the other type. This relationship can be extended to nested (deep) sequents using the relationship between tree-hypersequents and nested (deep) sequents, which we also sh...
متن کاملProof systems: from nestings to sequents and back
In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear nested systems. Moreover, we show a semantical characterisation of intuitionistic, multi-modal and non-normal modal logics for all these systems, via a case...
متن کاملComparing Modal Sequent Systems
This is an exploratory and expository paper, comparing display logic formulations of normal modal logics with labelled sequent systems. We provide a translation from display sequents into labelled sequents. The comparison between different systems gives us a different way to understand the difference between display systems and other sequent calculi as a difference between local and global view...
متن کاملA Modal Sequent Calculus for Propositional Separation Logic
In this paper, we give a sequent calculus for separation logic. Unlike the logic of bunched implications, this calculus does not have a tree-shaped context – instead, we use labelled deduction to control when hypotheses can and cannot be used. We prove that cut-elimination holds for this calculus, and show that it is sound with respect to the provability semantics of separation logic.
متن کاملProof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri’s general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Krip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003